منابع مشابه
Reconstruction de structures arborescentes par chemins minimaux et bande déformable
The proposed model is devoted to the segmentation and reconstruction of branching structures, like vascular trees. We rely on an explicit representation of a deformable tree, where topological relationships between segments are modeled. This allows easy posterior interactions and quantitative analysis, such as measuring diameters or lengths of vessels. Starting from a unique user-provided root ...
متن کاملComparaison des chemins de Hilbert adaptatif et des graphes de voisinage pour la caractérisation d'un parcellaire agricole
Résumé. Cet article compare deux représentations de données spatiales, les graphes de voisinages et les chemins de Hilbert-Peano, utilisées par des algorithmes de fouille. Cette comparaison s’appuie sur la mise en œuvre d’une méthode d’énumération de « sacs de nœuds », qui permet d’obtenir des caractérisations homogènes à partir des deux représentations. La méthode est appliquée à la caractéris...
متن کاملIndexation et interrogation de chemins de lecture en contexte pour la recherche d'information structurée sur le web
The growth of the Web gives new challenges in Information Retrieval (IR). Most of current systems are based on a re-use of traditional models, which have been developed for textual, atomic and independent documents and are not adapted to the Web. The Web structure is an essential aspect of the information description. Some approaches use this structure for IR, but most of them consider the whol...
متن کاملRecherche de chemins multiobjectifs pour la conception et la réalisation d'une centrale de mobilité destinée aux cyclistes
The work presented in this thesis aims at proposing methods for computing bicycle paths across a metropolitan. Unlike the problem of the classical shortest path, here the context is multiobjective because several criteria such as distance, safety and effort must be considered in the path computation. In a multiobjective problem, there is no single solution, but a set of compromise solutions. Th...
متن کاملMesure de similarité de graphes par noyau de sacs de chemins
A common approach for classifying shock graphs is to use a dissimilarity measure on graphs and a distance based classifier. In this paper, we propose the use of kernel functions for data mining problems on shock graphs. The first contribution of the paper is to extend the class of graph kernel by proposing kernels based on bag of paths. Then, we propose a methodology for using these kernels for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Questions de communication
سال: 2017
ISSN: 1633-5961,2259-8901
DOI: 10.4000/questionsdecommunication.11152